ALC-OFDM系统中的ACMS新选择准则

针对新一代宽带卫星通信,建立了自适应低密度奇偶校验码(LDPC)编译码的正交频分复用(ALC-OFDM)传输系统结构与信道模型.在分析固定编码调制方式基础上,提出了一种加权信噪比(SNR)的自适应编码调制方案(ACMS)选择新准则,使每种编码调制方案对应着一个信道平均信噪比范围,可以有效找出使系统吞吐量最优的信噪比切换门限值.仿真结果表明:在系统的误比特率(BER)满足要求的情况下,对比各种加权准则,加权得到的SNR越大,采用该准则的系统吞吐量越大;当系统吞吐量都达到最大值时,采用3种加权方式的信噪比切换门限比传统准则至少降低了2 dB.     

高精度角速率参数测量方法设计

针对目前武器弹药研究领域对高旋弹角速率测量范围宽、测量精度高的需求,提出了一种基于电磁感应原理的角速率参数测量方法,并设计了相应的传感器.利用现场可编程门阵列(FPGA)作为控制核心,构建角速率频率跟踪测量模型,实现对弹体角速率参数的测量,并采用周期清零的方式消除测量过程中的累积误差.仿真试验结果表明:该测量方法能够实现大动态范围1 ～ 100 rps的角速率测量,测量误差小于0.3％,满足高旋弹大转速、高精度的测量要求,在姿态测量和空间导航等领域具有一定的工程应用价值.     

连续线性切换系统的镇定慢切换设计

针对含有两个不稳定子系统的线性切换系统,设计一种包含时间驱动和状态驱动两个环节的切换法则,使线性切换系统稳定.在该切换法则下,系统的类Lyapunov函数在两个环节都不需要严格单调递减,使得系统在每个子系统有更长的驻留时间,从而有效降低系统的切换频率.在适当的假设条件下,带时变扰动的线性切换系统在该切换信号下具有良好的鲁棒稳定性.基于此,当系统可观测时,进一步设计了基于观测器的混合切换法则,实现了系统的鲁棒稳定.     

基于GReP通用可重构处理器的密码算子优化设计

以提升通用可重构处理器在信息安全应用领域的处理能力与执行效率为目的,对序列、分组、公钥及哈希函数等四大类32种密码算法进行深入分析。通过各算法的热点、频度分析,对基本处理单元进行同构、同态、参数化设计,提出了对密码算法性能影响大、复用性好且具有可重构特性的密码算子。以公钥密码算法中计算量大、实现复杂且被广泛使用的模乘算法为代表,提出了将密码算子映射到GReP（General-Purpose Reconfigurable Processor）通用可重构处理器上的方法。实验表明基于GReP通用可重构处理器架构实现的模乘算法其运行效率比Intel CORETM i7平台上实现效率提高60%左右。实验充分说明了GReP通用可重构处理器在提高处理能力与执行效率方面有明显优势。     

基于非合作博弈的OFDMA-WLAN系统资源分配算法研究

为满足无线局域网中基于正交频分多址技术(OFDMA-WLAN)的多用户通信需求,提出了一种基于非合作博弈的资源分配策略,利用博弈论这一有效工具对无线网络服务质量的资源分配问题进行研究,同时将用户对信道质量的不同需求转化为多用户对不同信道资源分配的非合作博弈竞争问题。此外,还将纳什均衡问题(NEP)细分为数个变分不等式子问题,通过凸优化函数对这些子问题分别求解。数值分析结果表明,所提算法在资源分配的公平性和数据传输率方面达到了更好的折中。     

Stability domains of the delay and PID coefficients for general time-delay systems

Time delays are encountered in many physical systems, and they usually threaten the stability and performance of closed-loop systems. The problem of determining all stabilising proportional-integral-derivative (PID) controllers for systems with perturbed delays is less investigated in the literature. In this study, the Rekasius substitution is employed to transform the system parameters to a new space. Then, the singular frequency (SF) method is revised for the Rekasius transformed system. A novel technique is presented to compute the ranges of time delay for which stable PID controller exists. This stability range cannot be readily computed from the previous methods. Finally, it is shown that similar to the original SF method, finite numbers of singular frequencies are sufficient to compute the stable regions in the space of time delay and controller coefficients.     

跳变系统在给定时间内的有限频段H∞控制

本文针对特定频段的干扰信号,为多模态跳变系统设计给定时间控制器,在给定时间内设法使各模态轨迹在期望范围受限运动,且具有更强的干扰抑制能力.所提控制方案不仅从时间角度为降低跳变系统控制器设计的保守性提供了思路,频段信息的引入也从频率角度降低了设计结果的保守性.仿真示例验证了所提算法的有效性以及优越性.     

考虑配送中心弹性库存的果品采购优化模型

为保证果品质量与降低运输成本,基于小批量多频次采购方式,提出考虑配送中心弹性库存的果品采购优化问题。以水果超市配送中心向多个供应商采购不同品种果品为对象,将库存变化因子引入周期性路径优化模型,建立果品采购优化模型,并设计一种两阶段求解的混合启发式算法。结合算例测试模型与算法的可行性,与已知最优解比较,目标解偏差约为2%,最大为3.3%,经验证,供应商和采购期数量在一定取值范围内,算法具有竞争优势,有利于改善超市物流中心的小批量多频次采购决策能力。     

智能宽带信号检测系统

为了能够准确的测量信号的参数,设计了一种宽带交直流信号检测系统,该系统的控制芯片采用的是STC12C5A32S2单片机.首先,信号采集电路采集到的信号经交直流测量电路进行处理;然后,通过分压和自动增益放大电路等处理后,在频率和相位检测电路中测量信号的频率和相位;最后,在液晶显示器上显示待测信号的幅度、相位和频率等信息.在实验中,测量了频率为0-20KHz的不同幅度信号,实验结果表明,在低频情况下测量误差可以忽略,在高频信号测量时的测量误差小于1%.     

Finding groups with maximum betweenness centrality

In this paper we consider the problem of identifying the most influential (or central) group of nodes (of some predefined size) in a network. Such a group has the largest value of betweenness centrality or one of its variants, for example, the length-scaled or the bounded-distance betweenness centralities. We demonstrate that this problem can be modelled as a mixed integer program (MIP) that can be solved for reasonably sized network instances using off-the-shelf MIP solvers. We also discuss interesting relations between the group betweenness and the bounded-distance betweenness centrality concepts. In particular, we exploit these relations in an algorithmic scheme to identify approximate solutions for the original problem of identifying the most central group of nodes. Furthermore, we generalize our approach for identification of not only the most central groups of nodes, but also central groups of graph elements that consists of either nodes or edges exclusively, or their combination according to some pre-specified criteria. If necessary, additional cohesiveness properties can also be enforced, for example, the targeted group should form a clique or a κ-club. Finally, we conduct extensive computational experiments with different types of real-life and synthetic network instances to show the effectiveness and flexibility of the proposed framework. Even more importantly, our experiments reveal some interesting insights into the properties of influential groups of graph elements modelled using the maximum betweenness centrality concept or one of its variations.